Bounded Treewidth Graphs – A Survey German Russian Winter School St. Petersburg, Russia

This survey gives an introduction to the class of bounded treewidth graphs, for which many NP-complete problems can be solved efficiently. The concept of a tree decomposition is explained. Subclasses of the bounded treewidth graphs are identified. Results about finding tree decompositions are summarized. Some problems which are efficiently solvable on bounded treewidth graphs are listed and algorithms for two of them – finding maximum independent sets and the calculation of the Tutte polynomial are sketched.